ACCORD: With Approximate Covering of Convex Orthogonal Decomposition
Identifieur interne : 002775 ( Main/Exploration ); précédent : 002774; suivant : 002776ACCORD: With Approximate Covering of Convex Orthogonal Decomposition
Auteurs : Mousumi Dutt [Inde] ; Arindam Biswas [Inde] ; Partha Bhowmick [Inde]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(nlogn) time for a hole-free object whose boundary consists of n pixels. The approximate/rough decomposition of the object is achieved by partitioning the inner cover (an orthogonal polygon) of the object into a set of orthogonal convex components. A set of rules is formulated based on the combinatorial cases and the decomposition is obtained by applying these rules while considering the concavities of the inner cover. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.
Url:
DOI: 10.1007/978-3-642-19867-0_41
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B37
- to stream Istex, to step Curation: 003A93
- to stream Istex, to step Checkpoint: 000675
- to stream Main, to step Merge: 002817
- to stream Main, to step Curation: 002775
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">ACCORD: With Approximate Covering of Convex Orthogonal Decomposition</title><author><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name></author><author><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name></author><author><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F7BE3658932F10585F84DE0D512BAC5E7B40823E</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19867-0_41</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-K78HZWSB-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003B37</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B37</idno><idno type="wicri:Area/Istex/Curation">003A93</idno><idno type="wicri:Area/Istex/Checkpoint">000675</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000675</idno><idno type="wicri:doubleKey">0302-9743:2011:Dutt M:accord:with:approximate</idno><idno type="wicri:Area/Main/Merge">002817</idno><idno type="wicri:Area/Main/Curation">002775</idno><idno type="wicri:Area/Main/Exploration">002775</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">ACCORD: With Approximate Covering of Convex Orthogonal Decomposition</title><author><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Department of Information Technology, Bengal Engineering and Science University, Shibpur, Howrah</wicri:regionArea><wicri:noRegion>Howrah</wicri:noRegion></affiliation><affiliation></affiliation></author><author><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Department of Information Technology, Bengal Engineering and Science University, Shibpur, Howrah</wicri:regionArea><wicri:noRegion>Howrah</wicri:noRegion></affiliation><affiliation></affiliation></author><author><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur</wicri:regionArea><wicri:noRegion>Kharagpur</wicri:noRegion></affiliation><affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(nlogn) time for a hole-free object whose boundary consists of n pixels. The approximate/rough decomposition of the object is achieved by partitioning the inner cover (an orthogonal polygon) of the object into a set of orthogonal convex components. A set of rules is formulated based on the combinatorial cases and the decomposition is obtained by applying these rules while considering the concavities of the inner cover. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.</div></front></TEI><affiliations><list><country><li>Inde</li></country></list><tree><country name="Inde"><noRegion><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name></noRegion><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002775 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002775 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F7BE3658932F10585F84DE0D512BAC5E7B40823E
|texte= ACCORD: With Approximate Covering of Convex Orthogonal Decomposition
}}
| This area was generated with Dilib version V0.6.33. |  |